Long-Lived Counters with Polylogarithmic Amortized Step Complexity

A shared-memory counter is a well-studied and widely-used concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. Jayanti, Tan and Toueg [Jayanti et al., 2000] proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read and write operations, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this paper, we address this gap. We present the first wait-free n-process counter, implemented using only read and write operations, whose amortized operation step complexity is O(log^2 n) in all executions. This is the first non-blocking read/write counter algorithm that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is optimal up to a logarithmic factor

Efficiently Testable Circuits

In this work, we put forward the notion of "efficiently testable circuits" and provide circuit compilers that transform any circuit into an efficiently testable one. Informally, a circuit is testable if one can detect tampering with the circuit by evaluating it on a small number of inputs from some test set. Our technical contribution is a compiler that transforms any circuit C into a testable circuit (C?,??) for which we can detect arbitrary tampering with all wires in C?. The notion of a testable circuit is weaker or incomparable to existing notions of tamper-resilience, which aim to detect or even correct for errors introduced by tampering during every query, but our new notion is interesting in several settings, and we achieve security against much more general tampering classes - like tampering with all wires - with very modest overhead. Concretely, starting from a circuit C of size n and depth d, for any L (think of L as a small constant, say L = 4), we get a testable (C?,??) where C? is of size ? 12n and depth d+log(n)+L? n^{1/L}. The test set ?? is of size 4? 2^L. The number of extra input and output wires (i.e., pins) we need to add for the testing is 3+L and 2^L, respectively

Efficiently Testable Circuits without Conductivity

The notion of ``efficiently testable circuits\u27\u27 (ETC) was recently put forward by Baig et al.~(ITCS\u2723). Informally, an ETC compiler takes as input any Boolean circuit $C$ and outputs a circuit/inputs tuple $(C\u27,\mathbb{T})$ where (completeness) $C\u27$ is functionally equivalent to $C$ and (security) if $C\u27$ is tampered in some restricted way, then this can be detected as $C\u27$ will err on at least one input in the small test set $\mathbb{T}$. The compiler of Baig et al. detects tampering even if the adversary can tamper with \emph{all} wires in the compiled circuit. Unfortunately, the model requires a strong ``conductivity\u27\u27 restriction: the compiled circuit has gates with fan-out up to 3, but wires can only be tampered in one way even if they have fan-out greater than one. In this paper, we solve the main open question from their work and construct an ETC compiler without this conductivity restriction. While Baig et al. use gadgets computing the AND and OR of particular subsets of the wires, our compiler computes inner products with random vectors. We slightly relax their security notion and only require that tampering is detected with high probability over the choice of the randomness. Our compiler increases the size of the circuit by only a small constant factor. For a parameter $\lambda$ (think $\lambda\le 5$), the number of additional input and output wires is $|C|^{1/\lambda}$, while the number of test queries to detect an error with constant probability is around $2^{2\lambda}$

The global burden of cancer attributable to risk factors, 2010-19 : a systematic analysis for the Global Burden of Disease Study 2019

Background Understanding the magnitude of cancer burden attributable to potentially modifiable risk factors is crucial for development of effective prevention and mitigation strategies. We analysed results from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2019 to inform cancer control planning efforts globally. Methods The GBD 2019 comparative risk assessment framework was used to estimate cancer burden attributable to behavioural, environmental and occupational, and metabolic risk factors. A total of 82 risk-outcome pairs were included on the basis of the World Cancer Research Fund criteria. Estimated cancer deaths and disability-adjusted life-years (DALYs) in 2019 and change in these measures between 2010 and 2019 are presented. Findings Globally, in 2019, the risk factors included in this analysis accounted for 4.45 million (95% uncertainty interval 4.01-4.94) deaths and 105 million (95.0-116) DALYs for both sexes combined, representing 44.4% (41.3-48.4) of all cancer deaths and 42.0% (39.1-45.6) of all DALYs. There were 2.88 million (2.60-3.18) risk-attributable cancer deaths in males (50.6% [47.8-54.1] of all male cancer deaths) and 1.58 million (1.36-1.84) risk-attributable cancer deaths in females (36.3% [32.5-41.3] of all female cancer deaths). The leading risk factors at the most detailed level globally for risk-attributable cancer deaths and DALYs in 2019 for both sexes combined were smoking, followed by alcohol use and high BMI. Risk-attributable cancer burden varied by world region and Socio-demographic Index (SDI), with smoking, unsafe sex, and alcohol use being the three leading risk factors for risk-attributable cancer DALYs in low SDI locations in 2019, whereas DALYs in high SDI locations mirrored the top three global risk factor rankings. From 2010 to 2019, global risk-attributable cancer deaths increased by 20.4% (12.6-28.4) and DALYs by 16.8% (8.8-25.0), with the greatest percentage increase in metabolic risks (34.7% [27.9-42.8] and 33.3% [25.8-42.0]). Interpretation The leading risk factors contributing to global cancer burden in 2019 were behavioural, whereas metabolic risk factors saw the largest increases between 2010 and 2019. Reducing exposure to these modifiable risk factors would decrease cancer mortality and DALY rates worldwide, and policies should be tailored appropriately to local cancer risk factor burden. Copyright (C) 2022 The Author(s). Published by Elsevier Ltd. This is an Open Access article under the CC BY 4.0 license.Peer reviewe

Long-lived counters with polylogarithmic amortized step complexity

A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), 2000), Jayanti, Tan and Toueg proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read-write registers, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this work, we address this gap. We show that n-process, wait-free and linearizable counters can be implemented from read-write registers with O(log2n) amortized step complexity. This is the first counter algorithm from read-write registers that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is within a logarithmic factor of the optimal. The worst-case step complexity of the construction remains linear, which is optimal. This is obtained thanks to a new max register construction with O(logn) amortized step complexity in executions of arbitrary length in which the value stored in the register does not grow too quickly. We then leverage an existing counter algorithm by Aspnes, Attiya and Censor-Hillel [1] in which we “plug” our max register implementation to show that it remains linearizable while achieving O(log2n) amortized step complexity

Long-lived snapshots with polylogarithmic amortized step complexity

We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest

Micro-Climatic effect on Cotton Yield, quality, Bt toxin amp%253B GT Gene

Unsuitable change in climatic conditions cause decline in quality and yield of major crops. Plant growth is directly affected if temperature, rainfall or humidity are not optimum. A multi-location and multi season evaluation of climatic effects on quality and yield may produce a reliable data for future breeding. A set of 39 upcoming varieties of cotton were evaluated on six different Micro-climatic locations of Punjab i.e. Multan, Bahawalpur, Sahiwal, Rahimyar khan, Vehari and Faisalabad in a triplicated trial. The experiment was repeated next year on same locations. Data for three key environmental factors such as temperature, rainfall and humidity was recorded at each station. The crop was analyzed for yield, fiber length, fiber strength and fiber fineness. The genotypes were also evaluated for Bt toxin and Glyphosate tolerance gene (GTG). The analysis revealed that high temperature has negative effect on yield, Bt expression, fineness, uniformity and GTG. Precipitation and humidity had positive effect on fiber fineness and uniformity, whereas, negative effect of both environmental factors was recorded for fiber length and strength. Increase in precipitation at early cropping stage was associated with increase in yield whereas higher humidity has negative impact on yield. As compared to high average temperature and number of days above 400C, cotton yield is more sensitive to heat waves (maximum temperature). Varieties with high temperature tolerance in cotton should be breed for climate change scenario

Grafting Key Trees: Efficient Key Management for Overlapping Groups

Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds log(N) keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting 2log(N) ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks.ISSN:0302-9743ISSN:1611-334

Induction and identification of colchicine induced polyploidy in Gladiolus grandiflorus ‘White Prosperity’

Gladiolus is one of the most important lucrative cut flower crops that is commercially cultivated worldwide due to its various spike forms, size, and shape and color combinations. In order to further increase the commercial and horticultural value by improving the ornamental traits of gladiolus ‘White Prosperity’, polyploidy was induced by soaking gladiolus corms in different colchicine concentrations (0.1%, 0.2% and 0.3%) for 24 h. Different colchicine concentrations had a little effect on sprouting and survival percentage but it significantly delayed the emergence of sprouts. About one third decreases in plant height along with reduction in number of leaves per plant, leaf area, length and width, chlorophyll content, diameter and number of cormlets per corm was observed in treated plants. Colchicine at 0.1% concentration improved the ornamental value of gladiolus by increasing vase life whereas colchicine at 0.3% was effective in increasing floret diameter. However, the colchicine treated plants exhibited delayed and reduced percentage of flowering corms. Pollen and stomatal study was done for the identification of polyploidy and it showed that both pollen and stomata size were increased while stomatal density and pollen fertility was significantly reduced in polyploid plants. Induction of polyploidy (mixoploids + octoploids) was achieved in all concentrations, however 0.2% and 0.3% concentrations of colchicine were effective for producing large number of polyploid plants. But at 0.1% concentration of colchicine, majority of plants did not show any change in their original ploidy level (tetraploid). These putative polyploids may be helpful for further improvement in ornamental and horticultural value of gladiolus